A Recognizer for Minimalist Grammars
نویسنده
چکیده
منابع مشابه
Semantic Aspects of Minimalist Grammars
Minimalist grammars are a rich lexicalized syntactic formalism which inherits the depth and wide covering of the generative tradition. Nevertheless up to now there is no straightforward way to extract the predicative structure of a sentence from syntactic analyses and from the predicative structure of the lexical items. In this paper we try to apply to this richer syntactic model the traditiona...
متن کاملA probabilistic top-down parser for minimalist grammars
This paper describes a probabilistic top-down parser for minimalist grammars. Top-down parsers have the great advantage of having a certain predictive power during the parsing, which takes place in a left-to-right reading of the sentence. Such parsers have already been well-implemented and studied in the case of Context-Free Grammars (see for example [Roa01]), which are already top-down, but th...
متن کاملA Note on the Complexity of the Recognition Problem for the Minimalist Grammars with Unbounded Scrambling and Barriers
Minimalist Grammars were proposed recently as a model for the formal description of the natural-language syntax. This paper explores a nonlocal extension to this formalism that would make it possible to describe unbounded scrambling which is a discriptionally problematic syntactic phenomenon attested in many languages. It is shown that extending Minimalist Grammars with scrambling without short...
متن کاملMorphological Agreement in Minimalist Grammars
Minimalist Grammars provide a useful tool for modeling natural language syntax by defining grammar fragments in a very precise way. As a formalization of the Minimalist Program, they can accommodate linguistic analyses from the field of generative syntax. However, they have no machinery for encoding agreement; while morphology can be simulated by multiplying lexical items, there is no systemati...
متن کاملTree Adjunction as Minimalist Lowering
Even though Minimalist grammars are more powerful than TAG on the string level, the classes of tree languages the two define are incomparable. I give a constructive proof that if the standard Move operation in Minimalist grammars is replaced by Reset Lowering, every TAG tree language can be generated. The opposite does not hold, so the strong generative capacity of Minimalist grammars with Rese...
متن کامل